Fast level-set based image segmentation using coherent propagation.

PURPOSE The level-set method is known to require long computation time for 3D image segmentation, which limits its usage in clinical workflow. The goal of this study was to develop a fast level-set algorithm based on the coherent propagation method and explore its character using clinical datasets. METHODS The coherent propagation algorithm allows level set functions to converge faster by forcing the contour to move monotonically according to a predicted developing trend. Repeated temporary backwards propagation, caused by noise or numerical errors, is then avoided. It also makes it possible to detect local convergence, so that the parts of the boundary that have reached their final position can be excluded in subsequent iterations, thus reducing computation time. To compensate for the overshoot error, forward and backward coherent propagation is repeated periodically. This can result in fluctuations of great magnitude in parts of the contour. In this paper, a new gradual convergence scheme using a damping factor is proposed to address this problem. The new algorithm is also generalized to non-narrow band cases. Finally, the coherent propagation approach is combined with a new distance-regularized level set, which eliminates the needs of reinitialization of the distance. RESULTS Compared with the sparse field method implemented in the widely available ITKSnap software, the proposed algorithm is about 10 times faster when used for brain segmentation and about 100 times faster for aorta segmentation. Using a multiresolution approach, the new method achieved 50 times speed-up in liver segmentation. The Dice coefficient between the proposed method and the sparse field method is above 99% in most cases. CONCLUSIONS A generalized coherent propagation algorithm for level set evolution yielded substantial improvement in processing time with both synthetic datasets and medical images.